Decomposition by maxclique separators
نویسندگان
چکیده
We provide a minimal counterexample to the correctness of an algorithm proposed by R. Tarjan for decomposing a graph by maximal clique separators. We also suggest a modification to that algorithm which not only corrects it but also retains its O(nm) time complexity.
منابع مشابه
Combining Optimal and Atomic Decomposition of Terminology Association graphs
We introduce novel approaches of graph decomposition based on optimal separators and atoms generated by minimal clique separators. The decomposition process is applied to co-word graphs extracted from Web Of Science database. Two types of graphs are considered: co-keyword graphs based on the human indexation of abstracts and terminology graphs based on semi-automatic term extraction from abstra...
متن کاملNordic Journal of Computing Hard Graphs for the Randomized Boppana-halld Orsson Algorithm for Maxclique
A randomized version of the Maxclique approximation algorithm by Boppana and Halldd orsson is analyzed. The Boppana Halldd orsson algorithm has the best performance guarantee currently known for the Maxclique problem. This paper presents a class of graphs on which the performance ratio of the randomized version of the algorithm is not better than (p n) with probability greater than 1 ? 1=n !(1) .
متن کاملCharacterizing graph classes by intersections of neighborhoods
The interplay between maxcliques (maximal cliques) and intersections of closed neighborhoods leads to new types of characterizations of several standard graph classes. For instance, being hereditary clique-Helly is equivalent to every nontrivial maxclique Q containing the intersection of closed neighborhoods of two vertices of Q, and also to, in all induced subgraphs, every nontrivial maxclique...
متن کاملHard Graphs for the Randomized Boppana-Halldörsson Algorithm for MAXCLIQUE
A randomized version of the Maxclique approximation algorithm by Boppana and Halldórsson is analyzed. The Boppana Halldórsson algorithm has the best performance guarantee currently known for the Maxclique problem. This paper presents a class of graphs on which the performance ratio of the randomized version of the algorithm is not better than Ω( √ n) with probability greater than 1 − 1/n. CR Cl...
متن کاملAnisotropic ‘helmholtz’ Equations: Massively Parallel Structured Multifrontal Solver Using Nested Dissection Based Domain Decomposition with Separators of Variable Thickness
Abstract. We consider the discretization and approximate solution of inhomogeneous anisotropic ‘Helmholtz’ equations in 3D. The anisotropy comprises general (tilted) TI symmetries. In particular, we are concerned with solving these equations on a large domain, for a large number of different sources. We make use of a nested dissection based domain decomposition in a massively parallel multifron...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Mathematics
دوره 337 شماره
صفحات -
تاریخ انتشار 2014